Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency
نویسندگان
چکیده
منابع مشابه
Dynamic Threshold Public-Key Encryption
This paper deals with threshold public-key encryption which allows a pool of players to decrypt a ciphertext if a given threshold of authorized players cooperate. We generalize this primitive to the dynamic setting, where any user can dynamically join the system, as a possible recipient; the sender can dynamically choose the authorized set of recipients, for each ciphertext; and the sender can ...
متن کاملPublic-Key Encryption Schemes with Auxiliary Inputs
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one that may reveal the secret key informationtheoretically). Our schemes are based on the decisional Diffie-Hellman (DDH) and the Learning with Errors (LWE) problems. As an independent technical contribution, we extend th...
متن کاملLecture 17 : Constructions of Public - Key Encryption
In the previous lecture, we defined Public-Key Encryption system. We now proceed to define security in these systems. Intuitively, we would like the encryptions of different messages to be indistinguishable, even when the public key is known by the adversary. be a Public-Key Encryption system over the message space M. (Gen, Enc, Dec) is said to be secure, if for all p.p.t. A there exists a negl...
متن کاملRobust Key-Evolving Public Key Encryption Schemes
We propose a key-evolving paradigm to deal with the key exposure problem of public key encryption schemes. The key evolving paradigm is like the one used for forward-secure digital signature schemes. Let time be divided into time periods such that at time period j, the decryptor holds the secret key SKj , while the public key PK is fixed during its lifetime. At time period j, a sender encrypts ...
متن کاملBuilding Key-Private Public-Key Encryption Schemes
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts corresponding to the same message and identity, but generated using different TA master public-keys. This security property has applications in the prevention of traffic analysis in coalition networking environments. In this pap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.04.003